Rainbow independent sets on dense graph classes
نویسندگان
چکیده
Given a family I of independent sets in graph, rainbow set is an such that there injection ?:I?I where for each v?I, v contained ?(v). Aharoni et al. (2019) determined various graph classes C whether satisfies property every n, exists N=N(C,n) N size n contains n. In this paper, we add two dense satisfying property, namely, the class graphs bounded neighborhood diversity and r-powers expansion class.
منابع مشابه
Reconfiguration on nowhere dense graph classes
In the token jumping problem for a vertex subset problem Q on graphs we are given a graph G and two feasible solutions Ss, St ⊆ V (G) of Q with |Ss| = |St|, and imagine that a token is placed on each vertex of Ss. The problem is to determine whether there exists a sequence S1, . . . , Sn of feasible solutions, where S1 = Ss, Sn = St and each Si+1 results from Si, 1 ≤ i < n, by moving exactly on...
متن کاملNowhere Dense Graph Classes and Dimension
Nowhere dense graph classes provide one of the least restrictive notions of sparsity for graphs. Several equivalent characterizations of nowhere dense classes have been obtained over the years, using a wide range of combinatorial objects. In this paper we establish a new characterization of nowhere dense classes, in terms of poset dimension: A monotone graph class is nowhere dense if and only i...
متن کاملTarget Set Selection in Dense Graph Classes
In this paper we study the Target Set Selection problem, a fundamental problem in computational social choice, from a parameterized complexity perspective. Here for a given graph and a threshold for each vertex the task is to find a set of active vertices that activates whole graph. A vertex becomes active if the number of activated vertices in its neighborhood is at least its threshold. We giv...
متن کاملGraph Partitioning for Independent Sets
Computing maximum independent sets in graphs is an important problem in computer science. In this paper, we develop an evolutionary algorithm to tackle the problem. The core innovations of the algorithm are very natural combine operations based on graph partitioning and local search algorithms. More precisely, we employ a state-of-the-art graph partitioner to derive operations that enable us to...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2022
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.04.007